Technical Note—The Stochastic Queue Median Over a Finite Discrete Set
نویسندگان
چکیده
منابع مشابه
A Finite Capacity Priority Queue with Discouragement
In this paper we report on a study of a two level preemptive priority queue with balking and reneging for lower priority level. The inter-arrival and the service times for both levels follow exponential distribution. We use a finite difference equation approach for solving the balance equations of the governing queuing model whose states are described by functions of one independent variable. H...
متن کاملA Finite Set of Discrete Functions
Wolpert and Macready’s No Free Lunch theorem proves that no search algorithm is better than any other over all possible discrete functions. The meaning of the No Free Lunch theorem has, however, been the subject of intense debate. We prove that for local neighborhood search on problems of bounded complexity, where complexity is measured in terms of number of basins of attraction in the search s...
متن کاملDiscrete logarithms over finite fields
Discrete exponentiation in a finite field is a direct analog of ordinary exponentiation. The exponent can only be an integer, say n, but for w in a field F , w is defined except when w = 0 and n ≤ 0, and satisfies the usual properties, in particular w = ww and (for u and v in F ) (uv) = uv. The discrete logarithm is the inverse function, in analogy with the ordinary logarithm for real numbers. ...
متن کاملBargaining over a finite set of alternatives
We analyze bilateral bargaining over a finite set of alternatives. We look for “good” ordinal solutions to such problems and show that Unanimity Compromise and Rational Compromise are the only bargaining rules that satisfy a basic set of properties. We then extend our analysis to admit problems with countably infinite alternatives. We show that, on this class, no bargaining rule choosing finite...
متن کاملInteraction Transform of Set Functions over a Finite Set
The paper introduces a new transform of set functions over a finite set, which is linear and invertible as the well known Möbius transform in combinatorics. This transform leads to the interaction index, a central concept in multicriteria decision making. The interaction index of a singleton happens to be the Shapley value of the set function or, in terms of cooperative game theory, of the valu...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Operations Research
سال: 1989
ISSN: 0030-364X,1526-5463
DOI: 10.1287/opre.37.4.648